Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher
نویسندگان
چکیده
We present an algorithm for the inference of some Multiple Context-Free Grammars from Membership and Equivalence Queries, using the Minimally Adequate Teacher model of Angluin. This is an extension of the congruence based methods for learning some Context-Free Grammars proposed by Clark (ICGI 2010). We define the natural extension of the syntactic congruence to tuples of strings, and demonstrate we can efficiently learn the class of Multiple Context-Free Grammars where the non-terminals correspond to the congruence classes under this relation.
منابع مشابه
Distributional Learning of Some Context-Free Languages with a Minimally Adequate Teacher
Angluin showed that the class of regular languages could be learned from a Minimally Adequate Teacher (mat) providing membership and equivalence queries. Clark and Eyraud (2007) showed that some context free grammars can be identified in the limit from positive data alone by identifying the congruence classes of the language. In this paper we consider learnability of context free languages usin...
متن کاملLearning Regular Sets from Queries and Counterexamples
The problem of identifying an unknown regular set from examples of its members and nonmembers is addressed. It is assumed that the regular set is presented by a minimaMy adequate Teacher, which can answer membership queries about the set and can also test a conjecture and indicate whether it is equal to the unknown set and provide a counterexample if not. (A counterexample is a string in the sy...
متن کاملLearning non-deterministic finite automata from queries and counterexamples
In the recent theoretical research activity of inductive learning, in particular, of inductive inference, Angluin has introduced the model of learning called minimally adequate teacher (MAT), that is, the model of learning via membership queries and equivalence queries, and has shown that the class of regular languages is e ciently learnable using deterministic nite automata (DFAs) (Angluin 198...
متن کاملMinimization, Learning, and Conformance Testing of Boolean Programs
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motivated by the special structure of RSMs, we define a notion of modular visibly pushdown automata (modular VPA) and show that for the class of languages accepted by such automata, unique minimal modular VPA exist. This y...
متن کاملLearning Deterministically Recognizable Tree Series
We devise a learning algorithm for deterministically recognizable tree series where the weights are taken from a commutative group. For this, we use an adaptation of the minimal adequate teacher model that was originally introduced by Angluin. The algorithm runs in polynomial time and constructs the unique minimal deterministic bottom-up finite state weighted tree automaton that recognizes the ...
متن کامل